Picture decoding method

ABSTRACT

The invention relates to a method for ordering encoded pictures consisting of an encoding step for forming encoded pictures in an encoder. At least one group of pictures is formed of the pictures and a picture ID is defined for each picture of the group of pictures. In the method a transmission step is performed for transmitting said encoded pictures to a decoder. The encoded pictures are rearranged in decoding order and decoded for forming decoded pictures. In the encoding step a video sequence ID separate from the picture ID is defined for the encoded pictures, the video sequence ID being the same for each picture of the same group of pictures. In the decoding step the video sequence ID is used for determining which pictures belong to the same group of pictures. The invention also relates to a system, encoder, decoder, electronic device, software program and a storage medium.

CROSS REFERENCE TO RELATED APPLICATIONS

[0001] This application claims priority under 35 USC §119 to U.S. Provisional Patent Application No. 60/448,189 filed on Feb. 18, 2003.

FIELD OF THE INVENTION

[0002] The present invention relates to a method for ordering encoded pictures, the method consisting of an encoding step for forming encoded pictures in an encoder, an optional hypothetical decoding step for decoding said encoded pictures in the encoder, a transmission step for transmitting said encoded pictures to a decoder, and a rearranging step for arranging the decoded pictures in decoding order. The invention also relates to a system, an encoder, a decoder, a device, a computer program, a signal, a module and a computer program product.

BACKGROUND OF THE INVENTION

[0003] Published video coding standards include ITU-T H.261, ITU-T H.263, ISO/IEC MPEG-1, ISO/IEC MPEG-2, and ISO/IEC MPEG-4 Part 2. These standards are herein referred to as conventional video coding standards.

[0004] Video communication systems

[0005] Video communication systems can be divided into conversational and non-conversational systems. Conversational systems include video conferencing and video telephony. Examples of such systems include ITU-T Recommendations H.320, H.323, and H.324 that specify a video conferencing/telephony system operating in ISDN, IP, and PSTN networks respectively. Conversational systems are characterized by the intent to minimize the end-to-end delay (from audio-video capture to the far-end audio-video presentation) in order to improve the user experience.

[0006] Non-conversational systems include playback of stored content, such as Digital Versatile Disks (DVDs) or video files stored in a mass memory of a playback device, digital TV, and streaming. A short review of the most important standards in these technology areas is given below.

[0007] A dominant standard in digital video consumer electronics today is MPEG-2, which includes specifications for video compression, audio compression, storage, and transport. The storage and transport of coded video is based on the concept of an elementary stream. An elementary stream consists of coded data from a single source (e.g. video) plus ancillary data needed for synchronization, identification and characterization of the source information. An elementary stream is packetized into either constant-length or variable-length packets to form a Packetized Elementary Stream (PES). Each PES packet consists of a header followed by stream data called the payload. PES packets from various elementary streams are combined to form either a Program Stream (PS) or a Transport Stream (TS). PS is aimed at applications having negligible transmission errors, such as store-and-play type of applications. TS is aimed at applications that are susceptible of transmission errors. However, TS assumes that the network throughput is guaranteed to be constant.

[0008] There is a standardization effort going on in a Joint Video Team (JVT) of ITU-T and ISO/IEC. The work of JVT is based on an earlier standardization project in ITU-T called H.26L. The goal of the JVT standardization is to release the same standard text as ITU-T Recommendation H.264 and ISO/IEC International Standard 14496-10 (MPEG4 Part 10). The draft standard is referred to as the JVT coding standard in this paper, and the codec according to the draft standard is referred to as the JVT codec.

[0009] The codec specification itself distinguishes conceptually between a video coding layer (VCL), and a network abstraction layer (NAL). The VCL contains the signal processing functionality of the codec, things such as transform, quantization, motion search/compensation, and the loop filter. It follows the general concept of most of today's video codecs, a macroblock-based coder that utilizes inter picture prediction with motion compensation, and transform coding of the residual signal. The output of the VCL encoder are slices: a bit string that contains the macroblock data of an integer number of macroblocks, and the information of the slice header (containing the spatial address of the first macroblock in the slice, the initial quantization parameter, and similar). Macroblocks in slices are ordered consecutively in scan order unless a different macroblock allocation is specified, using the so-called Flexible Macroblock Ordering syntax. In-picture prediction, such as intra prediction and motion vector prediction, is used only within a slice.

[0010] The NAL encapsulates the slice output of the VCL into Network Abstraction Layer Units (NAL units or NALUs), which are suitable for the transmission over packet networks or the use in packet oriented multiplex environments. JVT's Annex B defines an encapsulation process to transmit such NALUs over byte-stream oriented networks.

[0011] The optional reference picture selection mode of H.263 and the NEWPRED coding tool of MPEG4 Part 2 enable selection of the reference frame for motion compensation per each picture segment, e.g., per each slice in H.263. Furthermore, the optional Enhanced Reference Picture Selection mode of H.263 and the JVT coding standard enable selection of the reference frame for each macroblock separately.

[0012] Reference picture selection enables many types of temporal scalability schemes. FIG. 1 shows an example of a temporal scalability scheme, which is herein referred to as recursive temporal scalability. The example scheme can be decoded with three constant frame rates. FIG. 2 depicts a scheme referred to as Video Redundancy Coding, where a sequence of pictures is divided into two or more independently coded threads in an interleaved manner. The arrows in these and all the subsequent figures indicate the direction of motion compensation and the values under the frames correspond to the relative capturing and displaying times of the frames.

[0013] Parameter Set Concept

[0014] One fundamental design concept of the JVT codec is to generate self-contained packets, to make mechanisms such as the header duplication unnecessary. The way how this was achieved is to decouple information that is relevant to more than one slice from the media stream. This higher layer meta information should be sent reliably, asynchronously and in advance from the RTP packet stream that contains the slice packets. This information can also be sent in-band in such applications that do not have an out-of-band transport channel appropriate for the purpose. The combination of the higher level parameters is called a Parameter Set. The Parameter Set contains information such as picture size, display window, optional coding modes employed, macroblock allocation map, and others.

[0015] In order to be able to change picture parameters (such as the picture size), without having the need to transmit Parameter Set updates synchronously to the slice packet stream, the encoder and decoder can maintain a list of more than one Parameter Set. Each slice header contains a codeword that indicates the Parameter Set to be used.

[0016] This mechanism allows to decouple the transmission of the Parameter Sets from the packet stream, and transmit them by external means, e.g. as a side effect of the capability exchange, or through a (reliable or unreliable) control protocol. It may even be possible that they get never transmitted but are fixed by an application design specification.

[0017] Transmission order

[0018] In conventional video coding standards, the decoding order of pictures is the same as the display order except for B pictures. A block in a conventional B picture can be bi-directionally temporally predicted from two reference pictures, where one reference picture is temporally preceding and the other reference picture is temporally succeeding in display order. Only the latest reference picture in decoding order can succeed the B picture in display order (exception: interlaced coding in H.263 where both field pictures of a temporally subsequent reference frame can precede a B picture in decoding order). A conventional B picture cannot be used as a reference picture for temporal prediction, and therefore a conventional B picture can be disposed without affecting the decoding of any other pictures.

[0019] The JVT coding standard includes the following novel technical features compared to earlier standards:

[0020] The decoding order of pictures is decoupled from the display order. The value of the frame_num syntax element indicates decoding order and the picture order count indicates the display order.

[0021] Reference pictures for a block in a B picture can either be before or after the B picture in display order. Consequently, a B picture stands for a bi-predictive picture instead of a bi-directional picture.

[0022] Pictures that are not used as reference pictures are marked explicitly. A picture of any type (intra, inter, B, etc.) can either be a reference picture or a non-reference picture. (Thus, a B picture can be used as a reference picture for temporal prediction of other pictures.)

[0023] A picture can contain slices that are coded with a different coding type.

[0024] In other words, a coded picture may consist of an intra-coded slice and a B-coded slice, for example.

[0025] Decoupling of display order from decoding order can be beneficial from compression efficiency and error resiliency point of view.

[0026] An example of a prediction structure potentially improving compression efficiency is presented in FIG. 3. Boxes indicate pictures, capital letters within boxes indicate coding types, numbers within boxes are picture numbers according to the JVT coding standard, and arrows indicate prediction dependencies. Note that picture B17 is a reference picture for pictures B18. Compression efficiency is potentially improved compared to conventional coding, because the reference pictures for pictures B18 are temporally closer compared to conventional coding with PBBP or PBBBP coded picture patterns. Compression efficiency is potentially improved compared to conventional PBP coded picture pattern, because part of reference pictures are bi-directionally predicted.

[0027]FIG. 4 presents an example of the intra picture postponement method that can be used to improve error resiliency. Conventionally, an intra picture is coded immediately after a scene cut or as a response to an expired intra picture refresh period, for example. In the intra picture postponement method, an intra picture is not coded immediately after a need to code an intra picture arises, but rather a temporally subsequent picture is selected as an intra picture. Each picture between the coded intra picture and the conventional location of an intra picture is predicted from the next temporally subsequent picture. As FIG. 4 shows, the intra picture postponement method generates two independent inter picture prediction chains, whereas conventional coding algorithms produce a single inter picture chain. It is intuitively clear that the two-chain approach is more robust against erasure errors than the one-chain conventional approach. If one chain suffers from a packet loss, the other chain may still be correctly received. In conventional coding, a packet loss always causes error propagation to the rest of the inter picture prediction chain.

[0028] Two types of ordering and timing information have been conventionally associated with digital video: decoding and presentation order. A closer look at the related technology is taken below.

[0029] A decoding timestamp (DTS) indicates the time relative to a reference clock that a coded data unit is supposed to be decoded. If DTS is coded and transmitted, it serves for two purposes: First, if the decoding order of pictures differs from their output order, DTS indicates the decoding order explicitly. Second, DTS guarantees a certain pre-decoder buffering (buffering of coded data units for a decoder) behavior provided that the reception rate is close to the transmission rate at any moment. In networks where the end-to-end latency varies, the second use of DTS plays no or little role. Instead, received data is decoded as fast as possible provided that there is room in the post-decoder buffer (for buffering of decoded pictures) for uncompressed pictures.

[0030] Carriage of DTS depends on the communication system and video coding standard in use. In MPEG-2 Systems, DTS can optionally be transmitted as one item in the header of a PES packet. In the JVT coding standard, DTS can optionally be carried as a part of Supplemental Enhancement Information (SEI), and it is used in the operation of the optional Hypothetical Reference Decoder. In ISO Base Media File Format, DTS is dedicated its own box type, Decoding Time to Sample Box. In many systems, such as RTP-based streaming systems, DTS is not carried at all, because decoding order is assumed to be the same as transmission order and exact decoding time does not play an important role.

[0031] H.263 optional Annex U and Annex W.6.12 specify a picture number that is incremented by 1 relative to the previous reference picture in decoding order. In the JVT coding standard, the frame_num syntax element (also referred to as frame number hereinafter) is specified similarly to the picture number of H.263. The JVT coding standard specifies a particular type of an intra picture, called an instantaneous decoding refresh (IDR) picture. No subsequent picture can refer to pictures that are earlier than the IDR picture in decoding order. An IDR picture is often coded as a response to a scene change. In the JVT coding standard, frame number is reset to 0 at an IDR picture, which can in some situations improve error resilience in case of a loss of the IDR picture as is presented in FIGS. 5a and 5 b. However, it should be noted that the scene information SEI message of the JVT coding standard can also be used for detecting scene changes.

[0032] H.263 picture number can be used to recover the decoding order of reference pictures. Similarly, the JVT frame number can be used to recover the decoding order of frames between an IDR picture (inclusive) and the next IDR picture (exclusive) in decoding order. However, because the complementary reference field pairs (consecutive pictures coded as fields that are of different parity) share the same frame number, their decoding order cannot be reconstructed from the frame numbers.

[0033] The H.263 picture number or JVT frame number of a non-reference picture is specified to be equal to the picture or frame number of the previous reference picture in decoding order plus 1. If several non-reference pictures are consecutive in decoding order, they share the same picture or frame number. The picture or frame number of a non-reference picture is also the same as the picture or frame number of the following reference picture in decoding order. The decoding order of consecutive non-reference pictures can be recovered using the Temporal Reference (TR) coding element in H.263 or the Picture Order Count (POC) concept of the JVT coding standard.

[0034] A presentation timestamp (PTS) indicates the time relative to a reference clock when a picture is supposed to be displayed. A presentation timestamp is also called a display timestamp, output timestamp, and composition timestamp.

[0035] Carriage of PTS depends on the communication system and video coding standard in use. In MPEG-2 Systems, PTS can optionally be transmitted as one item in the header of a PES packet. In the JVT coding standard, PTS can optionally be carried as a part of Supplemental Enhancement Information (SEI), and it is used in the operation of the Hypothetical Reference Decoder. In ISO Base Media File Format, PTS is dedicated its own box type, Composition Time to Sample Box where the presentation timestamp is coded relative to the corresponding decoding timestamp. In RTP, the RTP timestamp in the RTP packet header corresponds to PTS.

[0036] Many conventional video coding standards feature the Temporal Reference (TR) coding element that is similar to PTS in many aspects. In some of the conventional coding standards, such as MPEG-2 video, TR is reset to zero at the beginning of a Group of Pictures (GOP). In the JVT coding standard, there is no concept of time in the video coding layer. The Picture Order Count (POC) is specified for each frame and field and it is used similarly to TR in direct temporal prediction of B slices, for example. POC is reset to 0 at an IDR picture.

[0037] The RTP sequence number is normally a 16-bit unsigned value in the RTP header that is incremented by one for each RTP data packet sent, and may be used by the receiver to detect packet loss and to restore packet sequence.

[0038] Transmission of Multimedia Streams

[0039] A multimedia streaming system consists of a streaming server and a number of players, which access the server via a network. The network is typically packet-oriented and provides little or no means to guaranteed quality of service. The players fetch either pre-stored or live multimedia content from the server and play it back in real-time while the content is being downloaded. The type of communication can be either point-to-point or multicast. In point-to-point streaming, the server provides a separate connection for each player. In multicast streaming, the server transmits a single data stream to a number of players, and network elements duplicate the stream only if it is necessary.

[0040] When a player has established a connection to a server and requested for a multimedia stream, the server begins to transmit the desired stream. The player does not start playing the stream back immediately, but rather it typically buffers the incoming data for a few seconds. Herein, this buffering is referred to as initial buffering. Initial buffering helps to maintain pauseless playback, because, in case of occasional increased transmission delays or network throughput drops, the player can decode and play buffered data.

[0041] In order to avoid unlimited transmission delay, it is uncommon to favor reliable transport protocols in streaming systems. Instead, the systems prefer unreliable transport protocols, such as UDP, which, on one hand, inherit a more stable transmission delay, but, on the other hand, also suffer from data corruption or loss.

[0042] RTP and RTCP protocols can be used on top of UDP to control real-time communications. RTP provides means to detect losses of transmission packets, to reassemble the correct order of packets in the receiving end, and to associate a sampling time-stamp with each packet. RTCP conveys information about how large a portion of packets were correctly received, and, therefore, it can be used for flow control purposes.

[0043] Transmission Errors

[0044] There are two main types of transmission errors, namely bit errors and packet errors. Bit errors are typically associated with a circuit-switched channel, such as a radio access network connection in mobile communications, and they are caused by imperfections of physical channels, such as radio interference. Such imperfections may result into bit inversions, bit insertions and bit deletions in transmitted data. Packet errors are typically caused by elements in packet-switched networks. For example, a packet router may become congested; i.e. it may get too many packets as input and cannot output them at the same rate. In this situation, its buffers overflow, and some packets get lost. Packet duplication and packet delivery in different order than transmitted are also possible but they are typically considered to be less common than packet losses. Packet errors may also be caused by the implementation of the used transport protocol stack. For example, some protocols use checksums that are calculated in the transmitter and encapsulated with source-coded data. If there is a bit inversion error in the data, the receiver cannot end up into the same checksum, and it may have to discard the received packet.

[0045] Second (2G) and third generation (3G) mobile networks, including GPRS, UMTS, and CDMA-2000, provide two basic types of radio link connections, acknowledged and non-acknowledged. An acknowledged connection is such that the integrity of a radio link frame is checked by the recipient (either the Mobile Station, MS, or the Base Station Subsystem, BSS), and, in case of a transmission error, a retransmission request is given to the other end of the radio link. Due to link layer retransmission, the originator has to buffer a radio link frame until a positive acknowledgement for the frame is received. In harsh radio conditions, this buffer may overflow and cause data loss. Nevertheless, it has been shown that it is beneficial to use the acknowledged radio link protocol mode for streaming services. A non-acknowledged connection is such that erroneous radio link frames are typically discarded.

[0046] Packet losses can either be corrected or concealed. Loss correction refers to the capability to restore lost data perfectly as if no losses had ever been introduced. Loss concealment refers to the capability to conceal the effects of transmission losses so that they should not be visible in the reconstructed video sequence.

[0047] When a player detects a packet loss, it may request for a packet retransmission. Because of the initial buffering, the retransmitted packet may be received before its scheduled playback time. Some commercial Internet streaming systems implement retransmission requests using proprietary protocols. Work is going on in IETF to standardize a selective retransmission request mechanism as a part of RTCP.

[0048] A common feature for all of these retransmission request protocols is that they are not suitable for multicasting to a large number of players, as the network traffic may increase drastically. Consequently, multicast streaming applications have to rely on non-interactive packet loss control.

[0049] Point-to-point streaming systems may also benefit from non-interactive error control techniques. First, some systems may not contain any interactive error control mechanism or they prefer not to have any feedback from players in order to simplify the system. Second, retransmission of lost packets and other forms of interactive error control typically take a larger portion of the transmitted data rate than non-interactive error control methods. Streaming servers have to ensure that interactive error control methods do not reserve a major portion of the available network throughput. In practice, the servers may have to limit the amount of interactive error control operations. Third, transmission delay may limit the number of interactions between the server and the player, as all interactive error control operations for a specific data sample should preferably be done before the data sample is played back.

[0050] Non-interactive packet loss control mechanisms can be categorized to forward error control and loss concealment by post-processing. Forward error control refers to techniques in which a transmitter adds such redundancy to transmitted data that receivers can recover at least part of the transmitted data even if there are transmission losses. Error concealment by post-processing is totally receiver-oriented. These methods try to estimate the correct representation of erroneously received data.

[0051] Most video compression algorithms generate temporally predicted INTER or P pictures. As a result, a data loss in one picture causes visible degradation in the consequent pictures that are temporally predicted from the corrupted one. Video communication systems can either conceal the loss in displayed images or freeze the latest correct picture onto the screen until a frame which is independent from the corrupted frame is received.

[0052] In conventional video coding standards, the decoding order is coupled with the output order. In other words, the decoding order of I and P pictures is the same as their output order, and the decoding order of a B picture immediately follows the decoding order of the latter reference picture of the B picture in output order. Consequently, it is possible to recover the decoding order based on known output order. The output order is typically conveyed in the elementary video bitstream in the Temporal Reference (TR) field and also in the system multiplex layer, such as in the RTP header. Thus, in conventional video coding standards, the presented problem relating to the transmission order different from the decoding order did not exist.

[0053] It may be obvious for experts in the field that the decoding order of coded pictures could be reconstructed based on a frame counter within the video bitstream similar to H.263 picture number without a reset to 0 at an IDR picture (as done in the JVT coding standard). However, two problems may occur when that kind of solutions are used:

[0054] First, FIG. 5a presents a situation in which continuous numbering scheme is used. If, for example, the IDR picture 137 is lost (can not be received/decoded), the decoder continues to decode the succeeding pictures, but it uses a wrong reference picture. This causes error propagation to succeeding frames until the next frame, which is independent from the corrupted frame, is received and decoded correctly. In the example of FIG. 5b the frame number is reset to 0 at an IDR picture. Now, in a situation in which IDR picture 10 is lost, the decoder notifies that there is a big gap in picture numbering after the latest correctly decoded picture P36. The decoder can then assume that an error has occurred and can freeze the display to the picture P36 until the next frame which is independent from the corrupted frame is received and decoded.

[0055] Second, problems in splicing and sub-sequence removal are evident, if a receiver assumes a pre-defined numbering scheme, such as increment by one for each reference picture in decoding order. The receiver can use the pre-defined numbering scheme for loss detection. Splicing refers to the operation where a coded sequence is inserted into the middle of another coded sequence. An example of a practical use of splicing is insertion of advertisements in a digital TV broadcast. If a pre-defined numbering scheme is expected by the receiver, the transmitter must update the frame counter numbers during the transmission according to the position and frame count of spliced sequences. Similarly, if the transmitter decides not to transmit some sub-sequences to avoid network congestion in an IP packet network, for example, it needs to update the frame counter numbers during the transmission according to the position and frame count of disposed sub-sequences. The details of the sub-sequence concept will be described later in this description.

[0056] It may be obvious for experts in the field that the decoding order of NAL units could be reconstructed based on a NAL unit sequence number similar to the RTP sequence number but indicating the decoding order of NAL units instead of transmission order. However, two problems may occur when that kind of solutions are used:

[0057] First, in some cases, perfect recovery decoding order is not necessary. For example, SEI messages for a picture can typically be decoded at any order. If the decoder supports arbitrary slice ordering, slices of a picture can be decoded at any order. Consequently, NAL units are received out of NAL unit sequence number order due to unintentional packet scheduling differences in network elements, the receiver may unnecessarily wait for NAL units corresponding to missing NAL unit sequence numbers, even though NAL units with succeeding NAL unit sequence numbers could actually be decoded. This additional delay may decrease the subjective quality experienced in the video communication system in use. Furthermore, it may trigger the use of loss correction or concealment processes unnecessarily.

[0058] Second, some NAL units, such as slices for non-reference pictures and SEI NAL units, may be discarded by network elements without affecting the decoding process of other NAL units. Such disposal of NAL units would cause gaps in the received sequence of NAL unit sequence numbers. Conventionally, such as with the RTP sequence number, the receiver assumes a pre-defined numbering scheme, such as increment by one for each NAL unit in decoding order, and uses gaps in the sequence number for loss detection. This use of NAL unit sequence numbers contradicts with the possibility to dispose NAL units without affecting the decoding of other NAL units.

[0059] Sub-sequences

[0060] The JVT coding standard also includes a sub-sequence concept, which can enhance temporal scalability compared to the use of non-reference picture so that inter-predicted chains of pictures can be disposed as a whole without affecting the decodability of the rest of the coded stream.

[0061] A sub-sequence is a set of coded pictures within a sub-sequence layer. A picture resides in one sub-sequence layer and in one sub-sequence only. A sub-sequence does not depend on any other sub-sequence in the same or in a higher sub-sequence layer. A sub-sequence in layer 0 can be decoded independently of any other sub-sequences and previous long-term reference pictures. FIG. 6a discloses an example of a picture stream containing sub-sequences at layer 1.

[0062] A sub-sequence layer contains a subset of the coded pictures in a sequence. Sub-sequence layers are numbered with non-negative integers. A layer having a larger layer number is a higher layer than a layer having a smaller layer number. The layers are ordered hierarchically based on their dependency on each other so that a layer does not depend on any higher layer and may depend on lower layers. In other words, layer 0 is independently decodable, pictures in layer 1 may be predicted from layer 0, pictures in layer 2 may be predicted from layers 0 and 1, etc. The subjective quality is expected to increase along with the number of decoded layers.

[0063] The sub-sequence concept is included in the JVT coding standard as follows: The required_frame_num_update_behaviour_flag equal to 1 in the sequence parameter set signals that the coded sequence may not contain all sub-sequences. The usage of the required frame_num_update_behaviour_flag releases the requirement for the frame number increment of 1 for each reference frame. Instead, gaps in frame numbers are marked specifically in the decoded picture buffer. If a “missing” frame number is referred to in inter prediction, a loss of a picture is inferred. Otherwise, frames corresponding to “missing” frame numbers are handled as if they were normal frames inserted to the decoded picture buffer with the sliding window buffering mode. All the pictures in a disposed sub-sequence are consequently assigned a “missing” frame number in the decoded picture buffer, but they are never used in inter prediction for other sub-sequences.

[0064] The JVT coding standard also includes optional sub-sequence related SEI messages. The sub-sequence information SEI message is associated with the next slice in decoding order. It signals the sub-sequence layer and sub-sequence identifier (sub_seq_id) of the sub-seuqence to which the slice belongs.

[0065] The slice header of each IDR picture contains an identifier (idr_pic_id). If two IDR pictures are consecutive in decoding order, without any intervening picture, the value of idr_pic_id shall change from the first IDR picture to the other one. If the current picture resides in a sub-sequence whose first picture in decoding order is an IDR picture, the value of sub_seq_id shall be the same as the value of idr_pic_id of the IDR picture.

[0066] Decoding order of coded pictures in the JVT coding standard cannot generally be reconstructed based on frame numbers and sub-sequence identifiers. If transmission order differed from decoding order and coded pictures resided in sub-sequence layer 1, their decoding order relative to pictures in sub-sequence layer 0 could not be concluded based on sub-sequence identifiers and frame numbers. For example, consider the following coding scheme presented on FIG. 6b where output order runs from left to right, boxes indicate pictures, capital letters within boxes indicate coding types, numbers within boxes are frame numbers according to the JVT coding standard, underlined characters indicate non-reference pictures, and arrows indicate prediction dependencies. If pictures are transmitted in order 10, P1, P3, 10, P1, B2, B4, P5, it cannot be concluded to which independent group of pictures (independent GOP) picture B2 belongs. An independent GOP is a group of pictures which can be decoded correctly without any other pictures from other group of pictures.

[0067] It could be argued that in the previous example the correct independent GOP for picture B2 could be concluded based on its output timestamp. However, the decoding order of pictures cannot be recovered based on output timestamps and picture numbers, because decoding order and output order are decoupled. Consider the following example (FIG. 6c) where output order runs from left to right, boxes indicate pictures, capital letters within boxes indicate coding types, numbers within boxes are frame numbers according to the JVT coding standard, and arrows indicate prediction dependencies. If pictures are transmitted out of decoding order, it cannot be reliably detected whether picture P4 should be decoded after P3 of the first or second independent GOP in output order.

[0068] Primary and Redundant Pictures

[0069] A primary coded picture is a primary coded representation of a picture. The decoded primary coded picture covers the entire picture area, i.e., the primary coded picture contains all slices and macroblocks of the picture. A redundant coded picture is a redundant coded representation of a picture or a part of a picture that is not used for decoding unless the primary coded picture is missing or corrupted. The redundant coded picture is not required contain all macroblocks in the primary coded picture.

[0070] Buffering

[0071] Streaming clients typically have a receiver buffer that is capable of storing a relatively large amount of data. Initially, when a streaming session is established, a client does not start playing the stream back immediately, but rather it typically buffers the incoming data for a few seconds. This buffering helps to maintain continuous playback, because, in case of occasional increased transmission delays or network throughput drops, the client can decode and play buffered data. Otherwise, without initial buffering, the client has to freeze the display, stop decoding, and wait for incoming data. The buffering is also necessary for either automatic or selective retransmission in any protocol level. If any part of a picture is lost, a retransmission mechanism may be used to resend the lost data. If the retransmitted data is received before its scheduled decoding or playback time, the loss is perfectly recovered.

[0072] Coded pictures can be ranked according to their importance in the subjective quality of the decoded sequence. For example, non-reference pictures, such as conventional B pictures, are subjectively least important, because their absence does not affect decoding of any other pictures. Subjective ranking can also be made on data partition or slice group basis. Coded slices and data partitions that are subjectively the most important can be sent earlier than their decoding order indicates, whereas coded slices and data partitions that are subjectively the least important can be sent later than their natural coding order indicates. Consequently, any retransmitted parts of the most important slice and data partitions are more likely to be received before their scheduled decoding or playback time compared to the least important slices and data partitions.

SUMMARY OF THE INVENTION

[0073] The invention enables reordering of video data from transmission order to decoding order in video communication schemes where it is advantageous to transmit data out of decoding order.

[0074] In the present invention, in-band signalling of decoding order is conveyed from the transmitter to the receiver. The signalling may be complementary or substitutive to any signalling, such as frame numbers in the JVT coding standard, within the video bitstream that can be used to recover decoding order.

[0075] Complementary signalling to frame numbers in the JVT coding standard is presented in the following. Hereinafter, an independent GOP consists of pictures from an IDR picture (inclusive) to the next IDR picture (exclusive) in decoding order. Each NAL unit in the bitstream includes or is associated with a video sequence ID that remains unchanged for all NAL units within an independent GOP.

[0076] Video sequence ID of an independent GOP shall differ from the video sequence ID of the previous independent GOP in decoding order freely or it shall be incremented compared to the previous video sequence ID (in modulo arithmetic). In the former case, the decoding order of independent GOPs is determined by their reception order. For example, the independent GOP starting with the IDR picture that has the smallest RTP sequence number is decoded first. In the latter case, the independent GOPs are decoded in ascending order of video sequence IDs.

[0077] In the following description the invention is described by using encoder-decoder based system, but it is obvious that the invention can also be implemented in systems in which the video signals are stored. The stored video signals can be either uncoded signals stored before encoding, as encoded signals stored after encoding, or as decoded signals stored after encoding and decoding process. For example, an encoder produces bitstreams in decoding order. A file system receives audio and/or video bitstreams which are encapsulated e.g. in decoding order and stored as a file. In addition, the encoder and the file system can produce metadata which informs subjective importance of the pictures and NAL units, contains information on sub-sequences, inter alia. The file can be stored into a database from which a direct playback server can read the NAL units and encapsulate them into RTP packets. According to the optional metadata and the data connection in use, the direct playback server can modify the transmission order of the packets different from the decoding order, remove sub-sequences, decide what SEI-messages will be transmitted, if any, etc. In the receiving end the RTP packets are received and buffered. Typically, the NAL units are first reordered into correct order and after that the NAL units are delivered to the decoder.

[0078] According to the H.264 standard VCL NAL units are specified as those NAL units having nal_unit_type equal to 1 to 5, inclusive. In the standard the NAL unit types 1 to 5 are defined as follows:

[0079] 1 Coded slice of a non-IDR picture

[0080] 2 Coded slice data partition A

[0081] 3 Coded slice data partition B

[0082] 4 Coded slice data partition C

[0083] 5 Coded slice of an IDR picture Substitutive signalling to any decoding order information in the video bitstream is presented in the following according to an advantageous embodiment of the present invention. A Decoding Order Number (DON) indicates the decoding order of NAL units, in other the delivery order of the NAL units to the decoder. Hereinafter, DON is assumed to be a 16-bit unsigned integer without the loss of generality. Let DON of one NAL unit be D1 and DON of another NAL unit be D2. If D1<D2 and D2D1<32768, or if D1>D2 and D1−D2>=32768, then the NAL unit having DON equal to D1 precedes the NAL unit having DON equal to D2 in NAL unit delivery order. If D1<D2 and D2−D1>=32768, or if D1>D2 and D1−D2<32768, then the NAL unit having DON equal to D2 precedes the NAL unit having DON equal to D1 in NAL unit delivery order. NAL units associated with different primary coded pictures do not have the same value of DON. NAL units associated with the same primary coded picture may have the same value of DON. If all NAL units of a primary coded picture have the same value of DON, NAL units of a redundant coded picture associated with the primary coded picture can have a different value of DON than the NAL units of the primary coded picture. The NAL unit delivery order of NAL units having the same value of DON can, for example, be the following:

[0084] 1. Picture delimiter NAL unit, if any

[0085] 2. Sequence parameter set NAL units, if any

[0086] 3. Picture parameter set NAL units, if any

[0087] 4. SEI NAL units, if any

[0088] 5. Coded slice and slice data partition NAL units of the primary coded picture, if any

[0089] 6. Coded slice and slice data partition NAL units of the redundant coded pictures, if any

[0090] 7. Filler data NAL units, if any

[0091] 8. End of sequence NAL unit, if any

[0092] 9. End of stream NAL unit, if any.

[0093] According to a first aspect of the present invention there is provided a method primarily characterized in that in the encoding step a video sequence ID separate from the picture ID is defined for the encoded pictures.

[0094] According to a second aspect of the present invention there is provided an encoder for encoding pictures and for ordering encoded pictures, comprising an arranger for forming at least one group of pictures of the encoded pictures and defining a picture ID for each picture of the group of pictures, the encoder further comprising a definer for defining a video sequence ID separate from the picture ID for the encoded pictures, the video sequence ID arranged to be the same for each picture of the same group of pictures.

[0095] According to a third aspect of the present invention there is provided a decoder for decoding the encoded pictures for forming decoded pictures, comprising a rearranger for arranging the encoded pictures in decoding order, the decoder further comprising a processor for determining which pictures belong to the same group of pictures by using the video sequence ID.

[0096] According to a fourth aspect of the present invention there is provided a software program comprising machine executable steps for performing a method for ordering encoded pictures, the method consisting of an encoding step for forming encoded pictures in an encoder, in which at least one group of pictures is formed, a picture ID is defined for each picture of the group of pictures, a transmission step for transmitting said encoded pictures to a decoder, a rearranging step for arranging the encoded pictures in decoding order, wherein in the encoding step a video sequence ID separate from the picture ID is defined for the encoded pictures.

[0097] According to a fifth aspect of the present invention there is provided a signal including encoded pictures, at least one group of pictures is formed from the encoded pictures, a picture ID is defined for each picture of the group of pictures, wherein a video sequence ID separate from the picture ID is defined in the signal for the encoded pictures, the video sequence ID being the same for each picture of the same group of pictures.

[0098] According to a sixth aspect of the present invention there is provided a method for ordering encoded pictures comprising a first and a second encoded picture, at least a first transmission unit is formed on the basis of the first encoded picture, at least a second transmission unit is formed on the basis of the second encoded picture, wherein a first identifier is defined for said first transmission unit and a second identifier is defined for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.

[0099] According to a seventh aspect of the present invention there is provided a device for ordering encoded pictures comprising a first and a second encoded picture, the device comprising an arranger for forming at least a first transmission unit on the basis of the first encoded picture and at least a second transmission unit on the basis of the second encoded picture, the device further comprising a definer for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.

[0100] According to a eighth aspect of the present invention there is provided an encoder for encoding pictures and for ordering encoded pictures comprising a first and a second encoded picture, the encoder comprising an arranger for forming at least a first transmission unit on the basis of the first encoded picture and at least a second transmission unit on the basis of the second encoded picture, the encoder further comprising a definer for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.

[0101] According to a ninth aspect of the present invention there is provided a decoder for decoding the encoded pictures for forming decoded pictures, the encoded pictures comprising a first and a second encoded picture transmitted in at least a first transmission unit formed on the basis of the first encoded picture and in at least a second transmission unit formed on the basis of the second encoded picture, the decoder further comprising a processor for determining the decoding order of information included in the first transmission unit and information included in the second transmission unit on the basis of a first identifier defined for said first transmission unit and a second identifier defined for said second transmission unit.

[0102] According to a tenth aspect of the present invention there is provided a system comprising an encoder for encoding pictures and for ordering encoded pictures comprising a first and a second encoded picture, the encoder comprising an arranger for forming at least a first transmission unit on the basis of the first encoded picture and at least a second transmission unit on the basis of the second encoded picture, and a decoder for decoding the encoded pictures, the system further comprising in the encoder a definer for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit, and a processor in the decoder for determining the decoding order of information included in the first transmission unit and information included in the second transmission unit on the basis of said first identifier and said second identifier.

[0103] According to a eleventh aspect of the present invention there is provided a computer program comprising machine executable steps for performing a method for ordering encoded pictures comprising a first and a second encoded picture, for forming at least a first transmission unit on the basis of the first encoded picture, and at least a second transmission unit on the basis of the second encoded picture, the computer program further comprising machine executable steps for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.

[0104] According to a twelfth aspect of the present invention there is provided a computer program product for storing a computer program comprising machine executable steps for performing a method for ordering encoded pictures comprising a first and a second encoded picture, for forming at least a first transmission unit on the basis of the first encoded picture, and at least a second transmission unit on the basis of the second encoded picture, the computer program further comprising machine executable steps for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.

[0105] According to a thirteenth aspect of the present invention there is provided a signal including at least a first transmission unit formed on the basis of a first encoded picture, and at least a second transmission unit formed on the basis of a second encoded picture, the signal further including a first identifier defined for said first transmission unit and a second identifier defined for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.

[0106] According to a fourteenth aspect of the present invention there is provided a module for ordering encoded pictures for transmission, the encoded pictures comprising a first and a second encoded picture, the module comprising an arranger for forming at least a first transmission unit on the basis of the first encoded picture and at least a second transmission unit on the basis of the second encoded picture, the module further comprising a definer for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.

[0107] According to a fifteenth aspect of the present invention there is provided a module for reordering encoded pictures for decoding, the encoded pictures comprising a first and a second encoded picture transmitted in at least a first transmission unit formed on the basis of the first encoded picture and in at least a second transmission unit formed on the basis of the second encoded picture, the module further comprising a processor for determining the decoding order of information included in the first transmission unit and information included in the second transmission unit on the basis of a first identifier defined for said first transmission unit and a second identifier defined for said second transmission unit.

[0108] The present invention improves the reliability of the coding systems. By using the present invention the correct decoding order of the pictures can be more reliably determined than in prior art systems even if some packets of a video stream are not available in the decoder.

DESCRIPTION OF THE DRAWINGS

[0109]FIG. 1 shows an example of a recursive temporal scalability scheme,

[0110]FIG. 2 depicts a scheme referred to as Video Redundancy Coding, where a sequence of pictures is divided into two or more independently coded threads in an interleaved manner,

[0111]FIG. 3 presents an example of a prediction structure potentially improving compression efficiency,

[0112]FIG. 4 presents an example of the intra picture postponement method that can be used to improve error resiliency,

[0113]FIGS. 5a and 5 b disclose different prior art numbering schemes for pictures of encoded video stream,

[0114]FIG. 6a discloses an example of a picture stream containing sub-sequences at layer 1,

[0115]FIG. 6b discloses an example of a picture stream containing two independent group of pictures having sub-sequences at layer 1,

[0116]FIG. 6c discloses an example of a picture stream of different independent group of pictures,

[0117]FIG. 7 discloses another example of a picture stream containing sub-sequences at layer 1,

[0118]FIG. 8 depicts an advantageous embodiment of the system according to the present invention,

[0119]FIG. 9 depicts an advantageous embodiment of the encoder according to the present invention,

[0120]FIG. 10 depicts an advantageous embodiment of the decoder according to the present invention,

[0121]FIG. 11a discloses an example of the NAL packetization format which can be used with the present invention, and

[0122]FIG. 11b discloses another example of the NAL packet format which can be used with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

[0123] In the following the invention will be described in more detail with reference to the system of FIG. 8, the encoder 1 and optional hypothetical reference decoder (HRD) 5 of FIG. 9 and decoder 2 of FIG. 10. The pictures to be encoded can be, for example, pictures of a video stream from a video source 3, e.g. a camera, a video recorder, etc. The pictures (frames) of the video stream can be divided into smaller portions such as slices. The slices can further be divided into blocks. In the encoder 1 the video stream is encoded to reduce the information to be transmitted via a transmission channel 4, or to a storage media (not shown). Pictures of the video stream are input to the encoder 1. The encoder has an encoding buffer 1.1 (FIG. 9) for temporarily storing some of the pictures to be encoded. The encoder 1 also includes a memory 1.3 and a processor 1.2 in which the encoding tasks according to the invention can be applied. The memory 1.3 and the processor 1.2 can be common with the transmitting device 6 or the transmitting device 6 can have another processor and/or memory (not shown) for other functions of the transmitting device 6. The encoder 1 performs motion estimation and/or some other tasks to compress the video stream. In motion estimation similarities between the picture to be encoded (the current picture) and a previous and/or latter picture are searched. If similarities are found the compared picture or part of it can be used as a reference picture for the picture to be encoded. In JVT the display order and the decoding order of the pictures are not necessarily the same, wherein the reference picture has to be stored in a buffer (e.g. in the encoding buffer 1.1) as long as it is used as a reference picture. The encoder 1 also inserts information on display order of the pictures into the transmission stream. In practice, either the timing information SEI message or timestamps external to the JVT syntax (such as RTP timestamps) can be used.

[0124] From the encoding process the encoded pictures are moved to an encoded picture buffer 1.2, if necessary. The encoded pictures are transmitted from the encoder 1 to the decoder 2 via the transmission channel 4. In the decoder 2 the encoded pictures are decoded to form uncompressed pictures corresponding as much as possible to the encoded pictures. Each decoded picture is buffered in the decoded picture buffer (DPB) 2.1 of the decoder 2 unless it is displayed substantially immediately after the decoding and is not used as a reference picture. In the system according to the present invention both the reference picture buffering and the display picture buffering are combined and they use the same decoded picture buffer 2.1. This eliminates the need for storing the same pictures in two different places thus reducing the memory requirements of the decoder 2.

[0125] The decoder 1 also includes a memory 2.3 and a processor 2.2 in which the decoding tasks according to the invention can be applied. The memory 2.3 and the processor 2.2 can be common with the receiving device 8 or the receiving device 8 can have another processor and/or memory (not shown) for other functions of the receiving device 8.

[0126] The payload format of RTP packets is defined as a number of different payload structures depending on need. However, which structure a received RTP packet contains is evident from the first byte of the payload. This byte will always be structured as a NAL unit header. The NAL unit type field indicates which structure is present. The possible structures are: Single NAL Unit Packet, Aggregation packet and Fragmentation unit. The Single NAL Unit Packet contains only a single NAL unit in the payload. The NAL header type field will be equal to the original NAL unit type, i.e., in the range of 1 to 23, inclusive. The Aggregation packet type is used to aggregate multiple NAL units into a single RTP payload. This packet exists in four versions, the Single-Time Aggregation Packet type A (STAP-A), the Single-Time Aggregation Packet type B (STAP-B), Multi-Time Aggregation Packet (MTAP) with 16 bit offset (MTAP16), and Multi-Time Aggregation Packet (MTAP) with 24 bit offset (MTAP24). The NAL unit type numbers assigned for STAP-A, STAP-B, MTAP16, and MTAP24 are 24, 25, 26, and 27 respectively. The Fragmentation unit is used to fragment a single NAL unit over multiple RTP packets. It exists with two versions identified with the NAL unit type numbers 28 and 29.

[0127] There are three cases of packetization modes defined for RTP packet transmission:

[0128] Single NAL unit mode,

[0129] Non-interleaved mode, and

[0130] Interleaved mode.

[0131] The single NAL unit mode is targeted for conversational systems that comply with ITU-T Recommendation H.241. The non-interleaved mode is targeted for conversational systems that may not comply with ITU-T Recommendation H.241. In the non-interleaved mode NAL units are transmitted in NAL unit decoding order. The interleaved mode is targeted for systems that do not require very low end-to-end latency. The interleaved mode allows transmission of NAL units out of NAL unit decoding order.

[0132] The packetization mode in use may be signaled by the value of the optional packetization-mode MIME parameter or by external means. The used packetization mode governs which NAL unit types are allowed in RTP payloads.

[0133] In the interleaved packetization mode, the transmission order of NAL units is allowed to differ from the decoding order of the NAL units. Decoding order number (DON) is a field in the payload structure or a derived variable that indicates the NAL unit decoding order.

[0134] The coupling of transmission and decoding order is controlled by the optional interleaving-depth MIME parameter as follows. When the value of the optional interleaving-depth MIME parameter is equal to 0 and transmission of NAL units out of their decoding order is disallowed, the transmission order of NAL units conforms to the NAL unit decoding order. When the value of the optional interleaving-depth MIME parameter is greater than 0 or transmission of NAL units out of their decoding order is allowed, in particular,

[0135] the order of NAL units in an Multi-Time Aggregation Packet 16 (MTAP16) and an Multi-Time Aggregation Packet 24 (MTAP24) is not required to be the NAL unit decoding order, and

[0136] the order of NAL units composed by decapsulating Single-Time Aggregation Packets B (STAP-B), MTAPs, and Fragmentation Units B (FU-B) in two consecutive packets is not required to be the NAL unit decoding order.

[0137] The RTP payload structures for a single NAL unit packet, an STAP-A, and an FU-A do not include DON. STAP-B and FU-B structures include DON, and the structure of MTAPs enables derivation of DON.

[0138] If a transmitter wants to encapsulate one NAL unit per packet and transmit packets out of their decoding order, STAP-B packet type can be used.

[0139] In the single NAL unit packetization mode, the transmission order of NAL units is the same as their NAL unit decoding order. In the non-interleaved packetization mode, the transmission order of NAL units in single NAL unit packets and STAP-As, and FU-As is the same as their NAL unit decoding order. The NAL units within a STAP appear in the NAL unit decoding order.

[0140] Due to the fact that H.264 allows the decoding order to be different from the display order, values of RTP timestamps may not be monotonically non-decreasing as a function of RTP sequence numbers.

[0141] The DON value of the first NAL unit in transmission order may be set to any value. Values of DON are in the range of 0 to 65535, inclusive. After reaching the maximum value, the value of DON wraps around to 0.

[0142] The decoding order of two NAL units contained in any STAP-B, MTAP, or a series of fragmentation units starting with an FU-B is determined as follows. Let the value of DON of one NAL unit be D1 and the value of DON of another NAL unit be D2. If D1 equals to D2, then the NAL unit decoding order of the two NAL units can be whichever. If D1<D2 and D2−D1<32768, or if D1>D2 and D1−D2>=32768, then the NAL unit having a value of DON equal to D1 precedes the NAL unit having a value of DON equal to D2 in NAL unit decoding order. If D1<D2 and D2−D1>=32768, or if D1>D2 and D1−D2<32768, then the NAL unit having a value of DON equal to D2 precedes the NAL unit having a value of DON equal to D1 in NAL unit decoding order. Values of DON related fields are such that the decoding order determined by the values of DON as specified above conforms to the NAL unit decoding order. If the order of two consecutive NAL units in the NAL unit stream is switched and the new order still conforms to the NAL unit decoding order, the NAL units may have the same value of DON. For example, when arbitrary slice order is allowed by the video coding profile in use, all the coded slice NAL units of a coded picture are allowed to have the same value of DON. Consequently, NAL units having the same value of DON can be decoded in any order, and two NAL units having a different value of DON should be passed to the decoder in the order specified above. When two consecutive NAL units in the NAL unit decoding order have a different value of DON, the value of DON for the second NAL unit in decoding order should be the value of DON for the first NAL unit in decoding order incremented by one. Receivers should not expect that the absolute difference of values of DON for two consecutive NAL units in the NAL unit decoding order is equal to one even in case of error-free transmission. An increment by one is not required, because at the time of associating values of DON to NAL units, it may not be known, whether all NAL units are delivered to the receiver. For example, a gateway may not forward coded slice NAL units of non-reference pictures or SEI NAL units, when there is a shortage of bitrate in the network to which the packets are forwarded. In another example a live broadcast is interrupted by pre-encoded content such as commercials from time to time. The first intra picture of a pre-encoded clip is transmitted in advance to ensure that it is readily available in the receiver. At the time of transmitting the first intra picture, the originator does not exactly know how many NAL units are going to be encoded before the first intra picture of the pre-encoded clip follows in decoding order. Thus, the values of DON for the NAL units of the first intra picture of the pre-encoded clip have to be estimated at the time of transmitting them and gaps in values of DON may occur.

[0143] Encoding

[0144] Let us now consider the encoding-decoding process in more detail. Pictures from the video source 3 are entered to the encoder 1 and advantageously stored in the pre-encoding buffer 1.1. The encoding process is not necessarily started immediately after the first picture is entered to the encoder, but after a certain amount of pictures are available in the encoding buffer 1.1. Then the encoder 1 tries to find suitable candidates from the pictures to be used as the reference frames. The encoder 1 then performs the encoding to form encoded pictures. The encoded pictures can be, for example, predicted pictures (P), bi-predictive pictures (B), and/or intra-coded pictures (I). The intra-coded pictures can be decoded without using any other pictures, but other type of pictures need at least one reference picture before they can be decoded. Pictures of any of the above mentioned picture types can be used as a reference picture.

[0145] The encoder advantageously attaches two time stamps to the pictures: a decoding time stamp (DTS) and output time stamp (OTS). The decoder can use the time stamps to determine the correct decoding time and time to output (display) the pictures. However, those time stamps are not necessarily transmitted to the decoder or it does not use them.

[0146] The encoder also forms sub-sequences on one or more layers above the lowest layer 0. The sub-sequences on layer 0 are independently decodable, but the pictures on higher layers may depend on pictures on some lower layer or layers. In the example of FIG. 6a there are two layers: layer 0 and layer 1. The pictures 10, P6 and P12 belong to the layer 0 while other pictures P1-P5, P7-P11 shown on FIG. 6a belong to the layer 1. Advantageously, the encoder forms groups of pictures (GOP) so that each picture of one GOP can be reconstructed by using only the pictures in the same GOP. In other words, one GOP contains at least one independently decodable picture and all the other pictures for which the independently decodable picture is a reference picture or a first reference picture in the chain of reference pictures. In the example of FIG. 7, there are two independent groups of pictures. The first independent group of pictures includes the pictures I0(0), P1(0), P3(0) on layer 0, and pictures B2(0), 2×B3(0), B4(0), 2×B5(0), B6(0), P5(0), P6(0) on layer 1. The second independent group of pictures includes the pictures 10(1), and P1(1) on layer 0, and pictures 2×B3(1) and B2(1) on layer 1. The pictures on layer 1 of each independent group of pictures are further arranged as sub-sequences. The first sub-sequence of the first independent group of pictures contains pictures B3(0), B2(0), B3(0), the second sub-sequence contains pictures B5(0), B4(0), B5(0), and the third sub-sequence contains pictures B6(0), P5(0), P6(0). The sub-sequence of the second independent group of pictures contains pictures B3(1), B2(1), B3(1). The numbers in brackets indicate the video sequence ID defined for the independent group of pictures in which the picture belongs.

[0147] The video sequence ID is transferred for each picture. It can be conveyed within the video bitstream, such as in the Supplemental Enhancement Information data. The video sequence ID can also be transmitted in the header fields of the transport protocol, such as within the RTP payload header of the JVT coding standard. The video sequence ID according to the presented partitioning to independent GOPs can be stored in the metadata of the video file format, such as in the MPEG-4 AVC file format.

[0148] Another advantageous method for signalling decoding order information in the video bitstream is briefly disclosed in the following. The encoder initialises a decoding order number (DON) to an appropriate starting value, e.g. 0. An increasing numbering scheme with wrap around is assumed here, having a certain maximum value. If, for example, the decoding order number is 16-bit unsigned integer, the maximum value is 65535. The encoder forms one or more NAL units from each primary encoded picture. The encoder can define the same decoding order number for each NAL unit of the same picture, and if redundant coded pictures (sub-sequences on higher layers) exist, the encoder can assign a different DON for NAL units of those redundant coded pictures. When the whole primary encoded picture and its possible redundant encoded pictures are encoded, the encoder begins to handle the next primary coded picture in decoding order. The encoder increments the decoding order number preferably by one, if the value of the decoding order number is smaller than said maximum value. If the decoding order number has the maximum value, the encoder sets the decoding order value to the minimum value which preferably is 0. Then, the encoder forms NAL units from said next primary encoded picture and assigns them the current value of the decoding order number. Respectively, if there exists any redundant encoded pictures of the same primary encoded picture, those are also transformed into NAL units. The operation continues until all the primary encoded pictures and respective redundant encoded pictures, if any, are handled. The transmitting device can begin to transmit the NAL units before all pictures are handled.

[0149] If the encoder is aware that the far-end decoder is incapable of handling the received slices in arbitrary order (i.e., out of raster scan order), the encoder should assign an ascending value of DON for each slice of a primary coded picture in raster scan order. That is, if a slice is transmitted in a single NAL unit each successive NAL unit has a different value of DON. If a slice is transmitted as data partition NAL units, each data partition NAL unit of a slice can share the same value of DON. For a slice of a redundant coded picture, the encoder assigns a value of DON that is larger than the value of DON of the corresponding slice in the corresponding primary coded picture.

[0150] In the receiver, the decoding order numbers can be used to determine the correct decoding order of the encoded pictures.

[0151]FIGS. 11a and 11 b disclose examples of the NAL packet formats which can be used with the present invention. The packet contains a header 11 and a payload part 12. The header 11 contains advantageously an error indicator field 11.1 (F, Forbidden), a priority field 11.2, and a type field 11.3. The error indicator field 11.1 indicates a bit error free NAL unit. Advantageously, when the error indicator field is set, the decoder is advised that bit errors may be present in the payload or in the NALU type octet. Decoders that are incapable of handling bit errors can then discard such packets. The priority field 11.2 is used for indicating the importance of the picture encapsulated in the payload part 12 of the packet. In an example implementation, the priority field can have four different values as follows. A value of 00 indicates that the content of the NALU is not used to reconstruct reference pictures (that can be used for future reference). Such NALUs can be discarded without risking the integrity of the reference pictures. Values above 00 indicate that the decoding of the NALU is required to maintain the integrity of the reference pictures. Furthermore, values above 00 indicate the relative transport priority, as determined by the encoder. Intelligent network elements can use this information to protect more important NALUs better than less important NALUs. 11 is the highest transport priority, followed by 10, then by 01 and, finally, 00 is the lowest.

[0152] The payload part 12 of the NALU contains at least a video sequence ID field 12.1, a field indicator 12.2, size field 12.3, timing info 12.4 and the encoded picture information 12.5. The video sequence ID field 12.1 is used for storing the number of the video sequence in which the picture belongs to. The field indicator 12.2 is used to signal whether the picture is a first or a second frame when two-frame picture format is used. Both frames may be coded as separate pictures. The first field indicator equal to 1 advantageously signals that the NALU belongs to a coded frame or a coded field that precedes the second coded field of the same frame in decoding order. The first field indicator equal to 0 signals that the NALU belongs to a coded field that succeeds the first coded field of the same frame in decoding order. The timing info field 11.3 is used for transforming time related information, if necessary.

[0153] The NAL units can be delivered in different kinds of packets. In this advantageous embodiment the different packet formats include simple packets and aggregation packets. The aggregation packets can further be divided into single-time aggregation packets and multi-time aggregation packets.

[0154] A simple packet according to this invention consists of one NALU. A NAL unit stream composed by decapsulating Simple Packets in RTP sequence number order should conform to the NAL unit delivery order.

[0155] Aggregation packets are the packet aggregation scheme of this payload specification. The scheme is introduced to reflect the dramatically different MTU sizes of two different type of networks—wireline IP networks (with an MTU size that is often limited by the Ethernet MTU size—roughly 1500 bytes), and IP or non-IP (e.g. H.324/M) based wireless networks with preferred transmission unit sizes of 254 bytes or less. In order to prevent media transcoding between the two worlds, and to avoid undesirable packetization overhead, a packet aggregation scheme is introduced.

[0156] Single-Time Aggregation Packet (STAP) aggregate NALUs with identical NALU-time. Respectively, Multi-Time Aggregation Packets (MTAP) aggregate NALUs with potentially differing NALU-time. Two different MTAPs are defined that differ in the length of the NALU timestamp offset. The term NALU-time is defined as the value the RTP timestamp would have if that NALU would be transported in its own RTP packet.

[0157] MTAPs and STAP share the following non-limiting packetization rules according to an advantageous embodiment of the present invention. The RTP timestamp must be set to the minimum of the NALU times of all the NALUs to be aggregated. The Type field of the NALU type octet must be set to the appropriate value as indicated in table 1. The error indicator field 11.1 must be cleared if all error indicator fields of the aggregated NALUs are zero, otherwise it must be set. TABLE 1 Type Packet Timestamp offset field length(in bits) 0×18 STAP 0 0×19 MTAP16 16 0×20 MTAP24 24

[0158] The NALU Payload of an aggregation packet consists of one or more aggregation units. An aggregation packet can carry as many aggregation units as necessary, however the total amount of data in an aggregation packet obviously must fit into an IP packet, and the size should be chosen such that the resulting IP packet is smaller than the MTU size.

[0159] Single-Time Aggregation Packet (STAP) should be used whenever aggregating NALUs that share the same NALU-time. The NALU payload of an STAP consists of the video sequence ID field 12.1 (e.g. 7 bits) and the field indicator 12.2 followed by Single-Picture Aggregation Units (SPAU). Single-Time Aggregation Packet type B (STAP-B) includes also the DON.

[0160] A video sequence according to this specification can be any part of NALU stream that can be decoded independently from other parts of the NALU stream.

[0161] A frame consists of two fields that may be coded as separate pictures. The first field indicator equal to 1 signals that the NALU belongs to a coded frame or a coded field that precedes the second coded field of the same frame in decoding order. The first field indicator equal to 0 signals that the NALU belongs to a coded field that succeeds the first coded field of the same frame in decoding order.

[0162] A Single-Picture Aggregation Unit consists of e.g. 16-bit unsigned size information that indicates the size of the following NALU in bytes (excluding these two octets, but including the NALU type octet of the NALU), followed by the NALU itself including its NALU type byte.

[0163] A Multi-Time Aggregation Packet (MTAP) has a similar architecture as an STAP. It consists of the NALU header byte and one or more Multi-Picture Aggregation Units. The choice between the different MTAP fields is application dependent—the larger the timestamp offset is the higher is the flexibility of the MTAP, but the higher is also the overhead.

[0164] Two different Multi-Time Aggregation Units are defined in this specification.

[0165] Both of them consist of e.g. 16 bits unsigned size information of the following NALU (same as the size information of in the STAP). In addition to these 16 bits there are also the video sequence ID field 12.1 (e.g. 7 bits), the field indicator 12.2 and n bits of timing information for this NALU, whereby n can e.g. be 16 or 24. The timing information field has to be set so that the RTP timestamp of an RTP packet of each NALU in the MTAP (the NALU-time) can be generated by adding the timing information from the RTP timestamp of the MTAP.

[0166] In another alternative embodiment the Multi-Time Aggregation Packet (MTAP) consists of the NALU header byte, a decoding order number base (DONB) field 12.1 (e.g. 16 bits), and one or more Multi-Picture Aggregation Units. The two different Multi-Time Aggregation Units are in this case defined as follows. Both of them consist of e.g. 16 bits unsigned size information of the following NALU (same as the size information of in the STAP). In addition to these 16 bits there are also the decoding order number delta (DOND) field 12.5 (e.g. 7 bits), and n bits of timing information for this NALU, whereby n can e.g. be 16 or 24. DON of the following NALU is equal to DONB+DOND. The timing information field has to be set so that the RTP timestamp of an RTP packet of each NALU in the MTAP (the NALU-time) can be generated by adding the timing information from the RTP timestamp of the MTAP. DONB may contain the smallest value of DON among the NAL units of the MTAP.

[0167] Transmission

[0168] The transmission and/or storing of the encoded pictures (and the optional virtual decoding) can be started immediately after the first encoded picture is ready. This picture is not necessarily the first one in decoder output order because the decoding order and the output order may not be the same.

[0169] When the first picture of the video stream is encoded the transmission can be started. The encoded pictures are optionally stored to the encoded picture buffer 1.2. The transmission can also start at a later stage, for example, after a certain part of the video stream is encoded.

[0170] The decoder 2 should also output the decoded pictures in correct order, for example by using the ordering of the picture order counts, and hence the reordering process need be defined clearly and normatively.

[0171] De-packetizing

[0172] The de-packetization process is implementation dependent. Hence, the following description is a non-restrictive example of a suitable implementation. Other schemes may be used as well. Optimizations relative to the described algorithms are likely possible.

[0173] The general concept behind these de-packetization rules is to reorder NAL units from transmission order to the NAL unit delivery order.

[0174] Decoding

[0175] Next, the operation of the receiver 8 will be described. The receiver 8 collects all packets belonging to a picture, bringing them into a reasonable order. The strictness of the order depends on the profile employed. The received packets are advantageously stored into the receiving buffer 9.1 (pre-decoding buffer). The receiver 8 discards anything that is unusable, and passes the rest to the decoder 2. Aggregation packets are handled by unloading their payload into individual RTP packets carrying NALUs. Those NALUs are processed as if they were received in separate RTP packets, in the order they were arranged in the Aggregation Packet.

[0176] For each NAL unit stored in the buffer, the RTP sequence number of the packet that contained the NAL unit is advantageously stored and associated with the stored NAL unit. Moreover, the packet type (Simple Packet or Aggregation Packet) that contained the NAL unit is stored and associated with each stored NAL unit.

[0177] Hereinafter, let N be the value of the optional num-reorder-VCL-NAL-units parameter (interleaving-depth parameter) which specifies the maximum amount of VCL NAL units that precede any VCL NAL unit in the packet stream in NAL unit delivery order and follow the VCL NAL unit in RTP sequence number order or in the composition order of the aggregation packet containing the VCL NAL unit. If the parameter is not present, a 0 value number could be implied. When the video stream transfer session is initialized, the receiver buffers at least N pieces of VCL NAL units into the receiving buffer 9.1 before passing any packet to the decoder 2.

[0178] When the receiver buffer 9.1 contains at least N VCL NAL units, NAL units are removed from the receiver buffer 9.1 and passed to the decoder 2 in the order specified below until the buffer contains N-1 VCL NAL units.

[0179] Hereinafter, let PVSID be the video sequence ID (VSID) of the latest NAL unit passed to the decoder. All NAL units in a STAP share the same VSID. The order in which NAL units are passed to the decoder is specified as follows: If the oldest RTP sequence number in the buffer corresponds to a Simple Packet, the NALU in the Simple Packet is the next NALU in the NAL unit delivery order. If the oldest RTP sequence number in the buffer corresponds to an Aggregation Packet, the NAL unit delivery order is recovered among the NALUs conveyed in Aggregation Packets in RTP sequence number order until the next Simple Packet (exclusive). This set of NALUs is hereinafter referred to as the candidate NALUs. If no NALUs conveyed in Simple Packets reside in the buffer, all NALUs belong to candidate NALUs.

[0180] For each NAL unit among the candidate NALUs, a VSID distance is calculated as follows. If the VSID of the NAL unit is larger than PVSID, the VSID distance is equal to VSID−PVSID. Otherwise, the VSID distance is equal to 2{circumflex over ( )}(number of bits used to signal VSID)−PVSID+VSID. NAL units are delivered to the decoder in ascending order of VSID distance. If several NAL units share the same VSID distance, the order to pass them to the decoder shall conform to the NAL unit delivery order defined in this specification. The NAL unit delivery order can be recovered as described in the following.

[0181] In the above the terms PVSID and VSID were used. It is obvious that also the terms PDON (the decoding order number of the previous NAL unit of an aggregation packet in NAL unit delivery order) and DON (decoding order number) can be used instead.

[0182] First, slices and data partitions are associated with pictures according to their frame numbers, RTP timestamps and first field flags: all NALUs sharing the same values of the frame number, the RTP timestamp and the first field flag belong to the same picture. SEI NALUs, sequence parameter set NALUs, picture parameter set NALUs, picture delimiter NALUs, end of sequence NALUs, end of stream NALUs, and filler data NALUs belong to the picture of the next VCL NAL unit in transmission order.

[0183] Second, the delivery order of the pictures is concluded based on nal_ref_idc, the frame number, the first field flag, and the RTP timestamp of each picture. The delivery order of pictures is in ascending order of frame numbers (in modulo arithmetic). If several pictures share the same value of frame number, the picture(s) that have nal_ref_idc equal to 0 are delivered first. If several pictures share the same value of frame number and they all have nal_ref_idc equal to 0, the pictures are delivered in ascending RTP timestamp order. If two pictures share the same RTP timestamp, the picture having first field flag equal to 1 is delivered first. Note that a primary coded picture and the corresponding redundant coded pictures are herein considered as one coded picture.

[0184] Third, if the video decoder in use does not support Arbitrary Slice Ordering, the delivery order of slices and A data partitions is in ascending order of the first_mb_in_slice syntax element in the slice header. Moreover, B and C data partitions immediately follow the corresponding A data partition in delivery order.

[0185] The following additional de-packetization rules may be used to implement an operational JVT de-packetizer: NALUs are presented to the JVT decoder in the order of the RTP sequence number. NALUs carried in an Aggregation Packet are presented in their order in the Aggregation packet. All NALUs of the Aggregation packet are processed before the next RTP packet is processed.

[0186] Intelligent RTP receivers (e.g. in Gateways) may identify lost DPAs. If a lost DPA is found, the Gateway MAY decide not to send the DPB and DPC partitions, as their information is meaningless for the JVT Decoder. In this way a network element can reduce network load by discarding useless packets, without parsing a complex bit stream.

[0187] Intelligent receivers may discard all packets that have a NAL Reference Idc of 0. However, they should process those packets if possible, because the user experience may suffer if the packets are discarded.

[0188] The DPB 2.1 contains memory places for storing a number of pictures. Those places are also called as frame stores in the description. The decoder 2 decodes the received pictures in correct order. To do so the decoder examines the video sequence ID information of the received pictures. If the encoder has selected the video sequence ID for each independent group of pictures freely, the decoder decodes the pictures of the independent group of pictures in the order in which they are received. If the encoder has defined for each independent group of pictures the video sequence ID by using incrementing (or decrementing) numbering scheme, the decoder decodes the independent group of pictures in the order of video sequence IDs. In other words, the independent group of pictures having the smallest (or biggest) video sequence ID is decoded first.

[0189] The present invention can be applied in many kind of systems and devices. The transmitting device 6 including the encoder 1 and optionally the HRD 5 advantageously include also a transmitter 7 to transmit the encoded pictures to the transmission channel 4. The receiving device 8 include the receiver 9 to receive the encoded pictures, the decoder 2, and a display 10 on which the decoded pictures can be displayed. The transmission channel can be, for example, a landline communication channel and/or a wireless communication channel. The transmitting device and the receiving device include also one or more processors 1.2, 2.2 which can perform the necessary steps for controlling the encoding/decoding process of video stream according to the invention. Therefore, the method according to the present invention can mainly be implemented as machine executable steps of the processors. The buffering of the pictures can be implemented in the memory 1.3, 2.3 of the devices. The program code 1.4 of the encoder can be stored into the memory 1.3. Respectively, the program code 2.4 of the decoder can be stored into the memory 2.3. 

1. A method for ordering encoded pictures, the method comprising an encoding step for forming encoded pictures in an encoder, in which at least one group of pictures is formed, a picture ID is defined for each picture of the group of pictures, a transmission step for transmitting said encoded pictures to a decoder, and a rearranging step for arranging the encoded pictures in decoding order, wherein in the encoding step a video sequence ID separate from the picture ID is defined for the encoded pictures.
 2. The method according to claim 1, wherein the video sequence ID being the same for each picture of the same group of pictures, wherein in the decoding step the video sequence ID is arranged to be used for determining which pictures belong to the same group of pictures.
 3. The method according to claim 1, wherein two or more group of pictures are formed, and different video sequence IDs are defined for said two or more group of pictures.
 4. The method according to claim 3, wherein the decoding order of the pictures is determined according to the video sequence ID.
 5. The method according to claim 3, wherein the decoding order of the video sequence IDs are transmitted on transmission layer, and the picture IDs are transmitted on video layer.
 6. A method for decoding encoded picture stream in a decoder, said stream comprising at least one group of pictures, for each picture of the group of pictures a picture ID has been defined, and for the group of pictures a video sequence ID separate from the picture ID has been defined, wherein in the decoding, the video sequence ID is used for determining which pictures belong to the same group of pictures.
 7. The method according to claim 6, wherein one picture of each group of pictures is an independently decodable picture for which said video sequence ID is defined, at least one sub-sequence is formed of the pictures of the group of pictures, and that each picture of the sub-sequence has the same video sequence ID as the independently decodable picture of the same group of pictures.
 8. An encoder for encoding pictures and for ordering encoded pictures, comprising an arranger for forming at least one group of pictures of the encoded pictures and defining a picture ID for each picture of the group of pictures, wherein the encoder further comprising a definer for defining a video sequence ID separate from the picture ID for the encoded pictures, the video sequence ID arranged to be the same for each picture of the same group of pictures.
 9. A decoder for decoding the encoded pictures for forming decoded pictures, comprising a rearranger for arranging the encoded pictures in decoding order, wherein the decoder further comprising a processor for determining which pictures belong to the same group of pictures by using the video sequence ID.
 10. A computer program comprising machine executable steps for performing a method for ordering encoded pictures, the method comprising an encoding step for forming encoded pictures in an encoder, in which at least one group of pictures is formed, a picture ID is defined for each picture of the group of pictures, a transmission step for transmitting said encoded pictures to a decoder, a rearranging step for arranging the encoded pictures in decoding order, wherein in the encoding step a video sequence ID separate from the picture ID is defined for the encoded pictures.
 11. A signal including encoded pictures, at least one group of pictures is formed from the encoded pictures, a picture ID is defined for each picture of the group of pictures, wherein a video sequence ID separate from the picture ID is defined in the signal for the encoded pictures, the video sequence ID being the same for each picture of the same group of pictures.
 12. A method for ordering encoded pictures comprising a first and a second encoded picture, at least a first transmission unit is formed on the basis of the first encoded picture, at least a second transmission unit is formed on the basis of the second encoded picture, wherein a first identifier is defined for said first transmission unit and a second identifier is defined for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.
 13. The method according to claim 12, wherein the identifier is defined as an integer number.
 14. The method according to claim 13, wherein a larger integer number with wrap around indicates a later decoding order.
 15. The method according to claim 12, wherein said first transmission unit includes a first slice and said second transmission unit includes a second slice.
 16. A device for ordering encoded pictures comprising a first and a second encoded picture, the device comprising an arranger for forming at least a first transmission unit on the basis of the first encoded picture and at least a second transmission unit on the basis of the second encoded picture, wherein the device further comprising a definer for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.
 17. The device according to claim 16, wherein it is a gateway device.
 18. The device according to claim 16, wherein it is a mobile communication device.
 19. The device according to claim 16, wherein it is a streaming server.
 20. An encoder for encoding pictures and for ordering encoded pictures comprising a first and a second encoded picture, the encoder comprising an arranger for forming at least a first transmission unit on the basis of the first encoded picture and at least a second transmission unit on the basis of the second encoded picture, wherein the encoder further comprising a definer for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.
 21. The device according to claim 20, wherein said arranger is arranged to include a first slice into said first transmission unit and a second slice into said second transmission unit.
 22. A decoder for decoding the encoded pictures for forming decoded pictures, the encoded pictures comprising a first and a second encoded picture transmitted in at least a first transmission unit formed on the basis of the first encoded picture and in at least a second transmission unit formed on the basis of the second encoded picture, wherein the decoder further comprising a processor for determining the decoding order of information included in the first transmission unit and information included in the second transmission unit on the basis of a first identifier defined for said first transmission unit and a second identifier defined for said second transmission unit.
 23. A system comprising an encoder for encoding pictures and for ordering encoded pictures comprising a first and a second encoded picture, the encoder comprising an arranger for forming at least a first transmission unit on the basis of the first encoded picture and at least a second transmission unit on the basis of the second encoded picture, and a decoder for decoding the encoded pictures, wherein the system further comprising in the encoder a definer for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit, and a processor in the decoder for determining the decoding order of information included in the first transmission unit and information included in the second transmission unit on the basis of said first identifier and said second identifier.
 24. A computer program comprising machine executable steps for performing a method for ordering encoded pictures comprising a first and a second encoded picture, for forming at least a first transmission unit on the basis of the first encoded picture, and at least a second transmission unit on the basis of the second encoded picture, wherein the computer program further comprising machine executable steps for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.
 25. A computer program product for storing a computer program comprising machine executable steps for performing a method for ordering encoded pictures comprising a first and a second encoded picture, for forming at least a first transmission unit on the basis of the first encoded picture, and at least a second transmission unit on the basis of the second encoded picture, wherein the computer program further comprising machine executable steps for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.
 26. A signal including at least a first transmission unit formed on the basis of a first encoded picture, and at least a second transmission unit formed on the basis of a second encoded picture, wherein the signal further including a first identifier defined for said first transmission unit and a second identifier defined for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.
 27. A module for ordering encoded pictures for transmission, the encoded pictures comprising a first and a second encoded picture, the module comprising an arranger for forming at least a first transmission unit on the basis of the first encoded picture and at least a second transmission unit on the basis of the second encoded picture, wherein the module further comprising a definer for defining a first identifier for said first transmission unit and a second identifier for said second transmission unit, the first and the second identifiers being indicative of the respective decoding order of information included in the first transmission unit and information included in the second transmission unit.
 28. A module for reordering encoded pictures for decoding, the encoded pictures comprising a first and a second encoded picture transmitted in at least a first transmission unit formed on the basis of the first encoded picture and in at least a second transmission unit formed on the basis of the second encoded picture, wherein the module further comprising a processor for determining the decoding order of information included in the first transmission unit and information included in the second transmission unit on the basis of a first identifier defined for said first transmission unit and a second identifier defined for said second transmission unit. 